A Compact Cell Structure for Scientific Visualization

Well designed data structures and access methods are vital to developing efficient visualization algorithms. The cell structure is a compact, general data structure for representing ndimensional topological constructs such as unstructured grids, polygonal, or triangle strip representations. The cell structure also provides constant time access methods for a wide variety of visualization algorithms. This paper describes the representation, access methods, and implementation of the cell structure. Sample algorithms such as decimation, triangle strip generation, and streamline propagation are used to illustrate its application.